Convergence of the dual greedy algorithm in Banach spaces
نویسندگان
چکیده
We show convergence of the weak dual greedy algorithm in wide class of Banach spaces, extending our previous result where it was shown to converge in subspaces of quotients of Lp (for 1 < p < ∞). In particular, we show it converges in the Schatten ideals Sp when 1 < p < ∞ and in any Banach lattice which is p-convex and q-concave with constants one, where 1 < p < q < ∞. We also discuss convergence of the algorithm for general convex functions.
منابع مشابه
Convergence theorems of multi-step iterative algorithm with errors for generalized asymptotically quasi-nonexpansive mappings in Banach spaces
The purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in Banach spaces. Our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملWeak Thresholding Greedy Algorithms in Banach Spaces
We consider weak thresholding greedy algorithms with respect to Markushevich bases in general Banach spaces. We find sufficient conditions for the equivalence of boundedness and convergence of the approximants. We also show that if there is a weak thresholding algorithm for the system which gives the best n-term approximation up to a multiplicative constant, then the system is already “greedy”....
متن کاملStrong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملConvergence of the weak dual greedy algorithm in Lp-spaces
We prove that the weak dual greedy algorithm converges in any subspace of a quotient of Lp when 1opoN: r 2003 Elsevier Inc. All rights reserved. A subset D of a (real) Banach space X is called a dictionary if (i) D is normalized i.e. if gAD implies jjgjj 1⁄4 1: (ii) D is symmetric i.e. D 1⁄4 D: (iii) D is fundamental i.e. 1⁄2D 1⁄4 X : Given xAX we are interested in algorithms which generate a s...
متن کامل